A bounding chain for Swendsen-Wang

نویسنده

  • Mark Huber
چکیده

The greatst drawback of Monte Carlo Markov chain methods is lack of knowledge of the mixing time of the chain. The use of bounding chains solves this difficulty for some chains by giving theoretical and experimental upper bounds on the mixing time. Moreover, when used with methodologies such as coupling from the past, bounding chains allow the user to take samples drawn exactly from the stationary distribution without knowledge of the mixing time. Here we present a bounding chain for the Swendsen-Wang process. The Swendsen-Wang bounding chain allow us to efficiently obtain exact samples from the ferromagnetic Q-state Potts model for certain classes of graphs. Also, by analyzing this bounding chain, we will show that Swendsen-Wang is rapidly mixing over a slightly larger range of parameters than was known previously. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 22: 43–59, 2003

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eecient Exact Sampling from the Ising Model Using Swendsen-wang

In Monte Carlo Markov Chain theory, a particle on a Markov chain is run for a 'long time' until the particle is nearly in the stationary distribution. Coupling from the past is a methodology which allows samples to be taken exactly from the stationary distribution of the chain, but which requires that we have a completely coupling chain. One chain often used for the ferromagnetic Ising model is...

متن کامل

Learnable Swendsen-Wang Cuts for Image Segmentation

We propose a framework for Bayesian unsupervised image segmentation with descriptive, learnable models. Our approach is based on learning descriptive models for segmentation and applying Monte Carlo Markov chain to traverse the solution space. Swendsen-Wang cuts are adapted to make meaningful jumps in solution space.

متن کامل

Bayesian variable selection and the Swendsen-Wang algorithm

The need to explore model uncertainty in linear regression models with many predictors has motivated improvements in Markov chain Monte Carlo sampling algorithms for Bayesian variable selection. Traditional sampling algorithms for Bayesian variable selection may perform poorly when there are severe multicollinearities amongst the predictors. In this paper we describe a new sampling method based...

متن کامل

Dynamic critical exponents of Swendsen-Wang and Wolff algorithms by nonequilibrium relaxation

With a nonequilibrium relaxation method, we calculate the dynamic critical exponent z of the two-dimensional Ising model for the SwendsenWang and Wolff algorithms. We examine dynamic relaxation processes following a quench from a disordered or an ordered initial state to the critical temperature Tc, and measure the exponential relaxation time of the system energy. For the Swendsen-Wang algorith...

متن کامل

Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models

The Gibbs sampler is a particularly popular Markov chain used for learning and inference problems in Graphical Models (GMs). These tasks are computationally intractable in general, and the Gibbs sampler often suffers from slow mixing. In this paper, we study the SwendsenWang dynamics which is a more sophisticated Markov chain designed to overcome bottlenecks that impede the Gibbs sampler. We pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Random Struct. Algorithms

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2003